Shortest Repetition-Free Words Accepted by Automata
نویسندگان
چکیده
We consider the following problem: given that a finite automaton M of N states accepts at least one k-power-free (resp., overlapfree) word, what is the length of the shortest such word accepted? We give upper and lower bounds which, unfortunately, are widely separated.
منابع مشابه
Problems Related to Shortest Strings in Formal Languages
In formal language theory, studying shortest strings in languages, and variations thereof, can be useful since these strings can serve as small witnesses for properties of the languages, and can also provide bounds for other problems involving languages. For example, the length of the shortest string accepted by a regular language provides a lower bound on the state complexity of the language. ...
متن کاملFinding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words
In the automata-theoretic approach to formal verification, the satisfiability and the model-checking problems for linear temporal logics are reduced to the nonemptiness problem of automata on infinite words. Modifying the nonemptiness algorithm to return a shortest witness to the nonemptiness (that is, a word of the form uvω that is accepted by the automaton and for which |uv| is minimal) has a...
متن کاملLower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata
The nonemptiness problem for nondeterministic automata on infinite words can be reduced to a sequence of reachability queries. The length of a shortest witness to the nonemptiness is then polynomial in the automaton. Nonemptiness algorithms for alternating automata translate them to nondeterministic automata. The exponential blow-up that the translation involves is justified by lower bounds for...
متن کاملSynchronizing Automata with Extremal Properties
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length Θ(n 2), where n is the number of states of the automaton. This disproves a conjecture that every subset in a strongly connected synchronizing automaton is cn-extendable, for some cons...
متن کاملComputing the Hamming Distance of a Regular Language in Quadratic Time∗
Given an arbitrary (nondeterministic) finite state automaton A we consider the problem of computing the Hamming distance of the language L(A) that is accepted by the automaton. This quantity is simply the minimum Hamming distance between any pair of distinct words from the language L(A). We show an algorithm that solves the problem in time quadratic with respect to the size of the given automat...
متن کامل